TSTP Solution File: SET624^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET624^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n017.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 09:07:41 EDT 2024
% Result : Theorem 0.08s 0.30s
% Output : Refutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 23
% Syntax : Number of formulae : 70 ( 1 unt; 9 typ; 0 def)
% Number of atoms : 543 ( 179 equ; 0 cnn)
% Maximal formula atoms : 28 ( 8 avg)
% Number of connectives : 518 ( 107 ~; 140 |; 57 &; 196 @)
% ( 13 <=>; 4 =>; 0 <=; 1 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 32 ( 32 >; 0 *; 0 +; 0 <<)
% Number of symbols : 19 ( 16 usr; 14 con; 0-2 aty)
% Number of variables : 87 ( 0 ^ 38 !; 48 ?; 87 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_2,type,
vEPSILON:
!>[X0: $tType] : ( ( X0 > $o ) > X0 ) ).
thf(func_def_5,type,
sK0: a > $o ).
thf(func_def_6,type,
sK1: a > $o ).
thf(func_def_7,type,
sK2: a > $o ).
thf(func_def_8,type,
sK3: a ).
thf(func_def_9,type,
sK4: a ).
thf(func_def_10,type,
sK5: a ).
thf(f85,plain,
$false,
inference(avatar_sat_refutation,[],[f43,f63,f64,f65,f66,f68,f69,f70,f71,f72,f75,f78,f81,f84]) ).
thf(f84,plain,
( ~ spl6_7
| ~ spl6_3
| ~ spl6_5 ),
inference(avatar_split_clause,[],[f83,f45,f36,f52]) ).
thf(f52,plain,
( spl6_7
<=> ( $true
= ( sK0 @ sK5 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_7])]) ).
thf(f36,plain,
( spl6_3
<=> ( $true
= ( sK2 @ sK5 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_3])]) ).
thf(f45,plain,
( spl6_5
<=> ! [X3: a] :
( ( $true
!= ( sK2 @ X3 ) )
| ( $true
!= ( sK0 @ X3 ) ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_5])]) ).
thf(f83,plain,
( ( $true
!= ( sK0 @ sK5 ) )
| ~ spl6_3
| ~ spl6_5 ),
inference(trivial_inequality_removal,[],[f82]) ).
thf(f82,plain,
( ( $true != $true )
| ( $true
!= ( sK0 @ sK5 ) )
| ~ spl6_3
| ~ spl6_5 ),
inference(superposition,[],[f46,f38]) ).
thf(f38,plain,
( ( $true
= ( sK2 @ sK5 ) )
| ~ spl6_3 ),
inference(avatar_component_clause,[],[f36]) ).
thf(f46,plain,
( ! [X3: a] :
( ( $true
!= ( sK2 @ X3 ) )
| ( $true
!= ( sK0 @ X3 ) ) )
| ~ spl6_5 ),
inference(avatar_component_clause,[],[f45]) ).
thf(f81,plain,
( ~ spl6_8
| ~ spl6_1
| ~ spl6_5 ),
inference(avatar_split_clause,[],[f80,f45,f28,f56]) ).
thf(f56,plain,
( spl6_8
<=> ( $true
= ( sK0 @ sK3 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_8])]) ).
thf(f28,plain,
( spl6_1
<=> ( $true
= ( sK2 @ sK3 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_1])]) ).
thf(f80,plain,
( ( $true
!= ( sK0 @ sK3 ) )
| ~ spl6_1
| ~ spl6_5 ),
inference(trivial_inequality_removal,[],[f79]) ).
thf(f79,plain,
( ( $true
!= ( sK0 @ sK3 ) )
| ( $true != $true )
| ~ spl6_1
| ~ spl6_5 ),
inference(superposition,[],[f46,f30]) ).
thf(f30,plain,
( ( $true
= ( sK2 @ sK3 ) )
| ~ spl6_1 ),
inference(avatar_component_clause,[],[f28]) ).
thf(f78,plain,
( ~ spl6_4
| ~ spl6_6
| ~ spl6_9 ),
inference(avatar_split_clause,[],[f77,f60,f48,f40]) ).
thf(f40,plain,
( spl6_4
<=> ( $true
= ( sK0 @ sK4 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_4])]) ).
thf(f48,plain,
( spl6_6
<=> ! [X5: a] :
( ( ( sK1 @ X5 )
!= $true )
| ( ( sK0 @ X5 )
!= $true ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_6])]) ).
thf(f60,plain,
( spl6_9
<=> ( $true
= ( sK1 @ sK4 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_9])]) ).
thf(f77,plain,
( ( $true
!= ( sK0 @ sK4 ) )
| ~ spl6_6
| ~ spl6_9 ),
inference(trivial_inequality_removal,[],[f76]) ).
thf(f76,plain,
( ( $true != $true )
| ( $true
!= ( sK0 @ sK4 ) )
| ~ spl6_6
| ~ spl6_9 ),
inference(superposition,[],[f49,f62]) ).
thf(f62,plain,
( ( $true
= ( sK1 @ sK4 ) )
| ~ spl6_9 ),
inference(avatar_component_clause,[],[f60]) ).
thf(f49,plain,
( ! [X5: a] :
( ( ( sK1 @ X5 )
!= $true )
| ( ( sK0 @ X5 )
!= $true ) )
| ~ spl6_6 ),
inference(avatar_component_clause,[],[f48]) ).
thf(f75,plain,
( ~ spl6_7
| ~ spl6_2
| ~ spl6_6 ),
inference(avatar_split_clause,[],[f74,f48,f32,f52]) ).
thf(f32,plain,
( spl6_2
<=> ( $true
= ( sK1 @ sK5 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_2])]) ).
thf(f74,plain,
( ( $true
!= ( sK0 @ sK5 ) )
| ~ spl6_2
| ~ spl6_6 ),
inference(trivial_inequality_removal,[],[f73]) ).
thf(f73,plain,
( ( $true != $true )
| ( $true
!= ( sK0 @ sK5 ) )
| ~ spl6_2
| ~ spl6_6 ),
inference(superposition,[],[f49,f34]) ).
thf(f34,plain,
( ( $true
= ( sK1 @ sK5 ) )
| ~ spl6_2 ),
inference(avatar_component_clause,[],[f32]) ).
thf(f72,plain,
( spl6_5
| spl6_5 ),
inference(avatar_split_clause,[],[f25,f45,f45]) ).
thf(f25,plain,
! [X3: a,X5: a] :
( ( $true
!= ( sK0 @ X3 ) )
| ( $true
!= ( sK2 @ X3 ) )
| ( ( sK0 @ X5 )
!= $true )
| ( $true
!= ( sK2 @ X5 ) ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f14,plain,
( ( ( ! [X3: a] :
( ( $true
!= ( sK0 @ X3 ) )
| ( $true
!= ( sK2 @ X3 ) ) )
& ! [X4: a] :
( ( $true
!= ( sK1 @ X4 ) )
| ( $true
!= ( sK0 @ X4 ) ) ) )
| ! [X5: a] :
( ( ( ( sK1 @ X5 )
!= $true )
& ( $true
!= ( sK2 @ X5 ) ) )
| ( ( sK0 @ X5 )
!= $true ) ) )
& ( ( ( $true
= ( sK0 @ sK3 ) )
& ( $true
= ( sK2 @ sK3 ) ) )
| ( ( $true
= ( sK1 @ sK4 ) )
& ( $true
= ( sK0 @ sK4 ) ) )
| ( ( ( $true
= ( sK1 @ sK5 ) )
| ( $true
= ( sK2 @ sK5 ) ) )
& ( $true
= ( sK0 @ sK5 ) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5])],[f9,f13,f12,f11,f10]) ).
thf(f10,plain,
( ? [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ( ! [X3: a] :
( ( ( X0 @ X3 )
!= $true )
| ( ( X2 @ X3 )
!= $true ) )
& ! [X4: a] :
( ( $true
!= ( X1 @ X4 ) )
| ( $true
!= ( X0 @ X4 ) ) ) )
| ! [X5: a] :
( ( ( $true
!= ( X1 @ X5 ) )
& ( $true
!= ( X2 @ X5 ) ) )
| ( $true
!= ( X0 @ X5 ) ) ) )
& ( ? [X6: a] :
( ( $true
= ( X0 @ X6 ) )
& ( $true
= ( X2 @ X6 ) ) )
| ? [X7: a] :
( ( $true
= ( X1 @ X7 ) )
& ( ( X0 @ X7 )
= $true ) )
| ? [X8: a] :
( ( ( $true
= ( X1 @ X8 ) )
| ( ( X2 @ X8 )
= $true ) )
& ( $true
= ( X0 @ X8 ) ) ) ) )
=> ( ( ( ! [X3: a] :
( ( $true
!= ( sK0 @ X3 ) )
| ( $true
!= ( sK2 @ X3 ) ) )
& ! [X4: a] :
( ( $true
!= ( sK1 @ X4 ) )
| ( $true
!= ( sK0 @ X4 ) ) ) )
| ! [X5: a] :
( ( ( ( sK1 @ X5 )
!= $true )
& ( $true
!= ( sK2 @ X5 ) ) )
| ( ( sK0 @ X5 )
!= $true ) ) )
& ( ? [X6: a] :
( ( $true
= ( sK0 @ X6 ) )
& ( $true
= ( sK2 @ X6 ) ) )
| ? [X7: a] :
( ( $true
= ( sK1 @ X7 ) )
& ( $true
= ( sK0 @ X7 ) ) )
| ? [X8: a] :
( ( ( $true
= ( sK1 @ X8 ) )
| ( $true
= ( sK2 @ X8 ) ) )
& ( $true
= ( sK0 @ X8 ) ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f11,plain,
( ? [X6: a] :
( ( $true
= ( sK0 @ X6 ) )
& ( $true
= ( sK2 @ X6 ) ) )
=> ( ( $true
= ( sK0 @ sK3 ) )
& ( $true
= ( sK2 @ sK3 ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f12,plain,
( ? [X7: a] :
( ( $true
= ( sK1 @ X7 ) )
& ( $true
= ( sK0 @ X7 ) ) )
=> ( ( $true
= ( sK1 @ sK4 ) )
& ( $true
= ( sK0 @ sK4 ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f13,plain,
( ? [X8: a] :
( ( ( $true
= ( sK1 @ X8 ) )
| ( $true
= ( sK2 @ X8 ) ) )
& ( $true
= ( sK0 @ X8 ) ) )
=> ( ( ( $true
= ( sK1 @ sK5 ) )
| ( $true
= ( sK2 @ sK5 ) ) )
& ( $true
= ( sK0 @ sK5 ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f9,plain,
? [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ( ! [X3: a] :
( ( ( X0 @ X3 )
!= $true )
| ( ( X2 @ X3 )
!= $true ) )
& ! [X4: a] :
( ( $true
!= ( X1 @ X4 ) )
| ( $true
!= ( X0 @ X4 ) ) ) )
| ! [X5: a] :
( ( ( $true
!= ( X1 @ X5 ) )
& ( $true
!= ( X2 @ X5 ) ) )
| ( $true
!= ( X0 @ X5 ) ) ) )
& ( ? [X6: a] :
( ( $true
= ( X0 @ X6 ) )
& ( $true
= ( X2 @ X6 ) ) )
| ? [X7: a] :
( ( $true
= ( X1 @ X7 ) )
& ( ( X0 @ X7 )
= $true ) )
| ? [X8: a] :
( ( ( $true
= ( X1 @ X8 ) )
| ( ( X2 @ X8 )
= $true ) )
& ( $true
= ( X0 @ X8 ) ) ) ) ),
inference(rectify,[],[f8]) ).
thf(f8,plain,
? [X1: a > $o,X2: a > $o,X0: a > $o] :
( ( ( ! [X3: a] :
( ( ( X1 @ X3 )
!= $true )
| ( ( X0 @ X3 )
!= $true ) )
& ! [X4: a] :
( ( ( X2 @ X4 )
!= $true )
| ( $true
!= ( X1 @ X4 ) ) ) )
| ! [X5: a] :
( ( ( $true
!= ( X2 @ X5 ) )
& ( $true
!= ( X0 @ X5 ) ) )
| ( $true
!= ( X1 @ X5 ) ) ) )
& ( ? [X3: a] :
( ( ( X1 @ X3 )
= $true )
& ( ( X0 @ X3 )
= $true ) )
| ? [X4: a] :
( ( ( X2 @ X4 )
= $true )
& ( $true
= ( X1 @ X4 ) ) )
| ? [X5: a] :
( ( ( $true
= ( X2 @ X5 ) )
| ( $true
= ( X0 @ X5 ) ) )
& ( $true
= ( X1 @ X5 ) ) ) ) ),
inference(flattening,[],[f7]) ).
thf(f7,plain,
? [X1: a > $o,X2: a > $o,X0: a > $o] :
( ( ( ! [X3: a] :
( ( ( X1 @ X3 )
!= $true )
| ( ( X0 @ X3 )
!= $true ) )
& ! [X4: a] :
( ( ( X2 @ X4 )
!= $true )
| ( $true
!= ( X1 @ X4 ) ) ) )
| ! [X5: a] :
( ( ( $true
!= ( X2 @ X5 ) )
& ( $true
!= ( X0 @ X5 ) ) )
| ( $true
!= ( X1 @ X5 ) ) ) )
& ( ? [X3: a] :
( ( ( X1 @ X3 )
= $true )
& ( ( X0 @ X3 )
= $true ) )
| ? [X4: a] :
( ( ( X2 @ X4 )
= $true )
& ( $true
= ( X1 @ X4 ) ) )
| ? [X5: a] :
( ( ( $true
= ( X2 @ X5 ) )
| ( $true
= ( X0 @ X5 ) ) )
& ( $true
= ( X1 @ X5 ) ) ) ) ),
inference(nnf_transformation,[],[f6]) ).
thf(f6,plain,
? [X1: a > $o,X2: a > $o,X0: a > $o] :
( ? [X5: a] :
( ( ( $true
= ( X2 @ X5 ) )
| ( $true
= ( X0 @ X5 ) ) )
& ( $true
= ( X1 @ X5 ) ) )
<~> ( ? [X3: a] :
( ( ( X1 @ X3 )
= $true )
& ( ( X0 @ X3 )
= $true ) )
| ? [X4: a] :
( ( ( X2 @ X4 )
= $true )
& ( $true
= ( X1 @ X4 ) ) ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ! [X2: a > $o,X0: a > $o,X1: a > $o] :
( ? [X5: a] :
( ( ( $true
= ( X2 @ X5 ) )
| ( $true
= ( X0 @ X5 ) ) )
& ( $true
= ( X1 @ X5 ) ) )
<=> ( ? [X3: a] :
( ( ( X1 @ X3 )
= $true )
& ( ( X0 @ X3 )
= $true ) )
| ? [X4: a] :
( ( ( X2 @ X4 )
= $true )
& ( $true
= ( X1 @ X4 ) ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ? [X3: a] :
( ( X0 @ X3 )
& ( X1 @ X3 ) )
| ? [X4: a] :
( ( X2 @ X4 )
& ( X1 @ X4 ) ) )
<=> ? [X5: a] :
( ( X1 @ X5 )
& ( ( X2 @ X5 )
| ( X0 @ X5 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X1: a > $o,X0: a > $o,X2: a > $o] :
( ( ? [X3: a] :
( ( X1 @ X3 )
& ( X0 @ X3 ) )
| ? [X3: a] :
( ( X2 @ X3 )
& ( X0 @ X3 ) ) )
<=> ? [X3: a] :
( ( X0 @ X3 )
& ( ( X2 @ X3 )
| ( X1 @ X3 ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X1: a > $o,X0: a > $o,X2: a > $o] :
( ( ? [X3: a] :
( ( X1 @ X3 )
& ( X0 @ X3 ) )
| ? [X3: a] :
( ( X2 @ X3 )
& ( X0 @ X3 ) ) )
<=> ? [X3: a] :
( ( X0 @ X3 )
& ( ( X2 @ X3 )
| ( X1 @ X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.MgwrP78npv/Vampire---4.8_5866',cBOOL_PROP_100_pme) ).
thf(f71,plain,
( spl6_2
| spl6_3
| spl6_4
| spl6_8 ),
inference(avatar_split_clause,[],[f20,f56,f40,f36,f32]) ).
thf(f20,plain,
( ( $true
= ( sK2 @ sK5 ) )
| ( $true
= ( sK0 @ sK4 ) )
| ( $true
= ( sK0 @ sK3 ) )
| ( $true
= ( sK1 @ sK5 ) ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f70,plain,
( spl6_6
| spl6_6 ),
inference(avatar_split_clause,[],[f24,f48,f48]) ).
thf(f24,plain,
! [X4: a,X5: a] :
( ( $true
!= ( sK1 @ X4 ) )
| ( ( sK0 @ X5 )
!= $true )
| ( ( sK1 @ X5 )
!= $true )
| ( $true
!= ( sK0 @ X4 ) ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f69,plain,
( spl6_9
| spl6_3
| spl6_2
| spl6_8 ),
inference(avatar_split_clause,[],[f22,f56,f32,f36,f60]) ).
thf(f22,plain,
( ( $true
= ( sK2 @ sK5 ) )
| ( $true
= ( sK0 @ sK3 ) )
| ( $true
= ( sK1 @ sK5 ) )
| ( $true
= ( sK1 @ sK4 ) ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f68,plain,
( spl6_1
| spl6_9
| spl6_7 ),
inference(avatar_split_clause,[],[f17,f52,f60,f28]) ).
thf(f17,plain,
( ( $true
= ( sK1 @ sK4 ) )
| ( $true
= ( sK2 @ sK3 ) )
| ( $true
= ( sK0 @ sK5 ) ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f66,plain,
( spl6_4
| spl6_7
| spl6_1 ),
inference(avatar_split_clause,[],[f15,f28,f52,f40]) ).
thf(f15,plain,
( ( $true
= ( sK0 @ sK4 ) )
| ( $true
= ( sK2 @ sK3 ) )
| ( $true
= ( sK0 @ sK5 ) ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f65,plain,
( spl6_2
| spl6_3
| spl6_9
| spl6_1 ),
inference(avatar_split_clause,[],[f18,f28,f60,f36,f32]) ).
thf(f18,plain,
( ( $true
= ( sK1 @ sK4 ) )
| ( $true
= ( sK2 @ sK5 ) )
| ( $true
= ( sK1 @ sK5 ) )
| ( $true
= ( sK2 @ sK3 ) ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f64,plain,
( spl6_7
| spl6_4
| spl6_8 ),
inference(avatar_split_clause,[],[f19,f56,f40,f52]) ).
thf(f19,plain,
( ( $true
= ( sK0 @ sK4 ) )
| ( $true
= ( sK0 @ sK5 ) )
| ( $true
= ( sK0 @ sK3 ) ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f63,plain,
( spl6_7
| spl6_8
| spl6_9 ),
inference(avatar_split_clause,[],[f21,f60,f56,f52]) ).
thf(f21,plain,
( ( $true
= ( sK1 @ sK4 ) )
| ( $true
= ( sK0 @ sK5 ) )
| ( $true
= ( sK0 @ sK3 ) ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f43,plain,
( spl6_1
| spl6_2
| spl6_3
| spl6_4 ),
inference(avatar_split_clause,[],[f16,f40,f36,f32,f28]) ).
thf(f16,plain,
( ( $true
= ( sK1 @ sK5 ) )
| ( $true
= ( sK0 @ sK4 ) )
| ( $true
= ( sK2 @ sK3 ) )
| ( $true
= ( sK2 @ sK5 ) ) ),
inference(cnf_transformation,[],[f14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : SET624^5 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.09 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.08/0.28 % Computer : n017.cluster.edu
% 0.08/0.28 % Model : x86_64 x86_64
% 0.08/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28 % Memory : 8042.1875MB
% 0.08/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28 % CPULimit : 300
% 0.08/0.28 % WCLimit : 300
% 0.08/0.28 % DateTime : Fri May 3 16:25:22 EDT 2024
% 0.08/0.28 % CPUTime :
% 0.08/0.28 This is a TH0_THM_NEQ_NAR problem
% 0.08/0.28 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.MgwrP78npv/Vampire---4.8_5866
% 0.08/0.29 % (6114)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on Vampire---4 for (3000ds/4Mi)
% 0.08/0.29 % (6117)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on Vampire---4 for (3000ds/2Mi)
% 0.08/0.29 % (6120)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on Vampire---4 for (3000ds/3Mi)
% 0.08/0.30 % (6115)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on Vampire---4 for (3000ds/27Mi)
% 0.08/0.30 % (6113)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on Vampire---4 for (3000ds/183Mi)
% 0.08/0.30 % (6116)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on Vampire---4 for (3000ds/2Mi)
% 0.08/0.30 % (6119)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on Vampire---4 for (3000ds/18Mi)
% 0.08/0.30 % (6117)Instruction limit reached!
% 0.08/0.30 % (6117)------------------------------
% 0.08/0.30 % (6117)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.08/0.30 % (6117)Termination reason: Unknown
% 0.08/0.30 % (6117)Termination phase: Saturation
% 0.08/0.30
% 0.08/0.30 % (6117)Memory used [KB]: 5500
% 0.08/0.30 % (6117)Time elapsed: 0.003 s
% 0.08/0.30 % (6117)Instructions burned: 3 (million)
% 0.08/0.30 % (6117)------------------------------
% 0.08/0.30 % (6117)------------------------------
% 0.08/0.30 % (6120)Instruction limit reached!
% 0.08/0.30 % (6120)------------------------------
% 0.08/0.30 % (6120)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.08/0.30 % (6120)Termination reason: Unknown
% 0.08/0.30 % (6120)Termination phase: Saturation
% 0.08/0.30
% 0.08/0.30 % (6120)Memory used [KB]: 5500
% 0.08/0.30 % (6120)Time elapsed: 0.003 s
% 0.08/0.30 % (6120)Instructions burned: 3 (million)
% 0.08/0.30 % (6120)------------------------------
% 0.08/0.30 % (6120)------------------------------
% 0.08/0.30 % (6114)Instruction limit reached!
% 0.08/0.30 % (6114)------------------------------
% 0.08/0.30 % (6114)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.08/0.30 % (6114)Termination reason: Unknown
% 0.08/0.30 % (6114)Termination phase: Saturation
% 0.08/0.30
% 0.08/0.30 % (6114)Memory used [KB]: 5500
% 0.08/0.30 % (6114)Time elapsed: 0.003 s
% 0.08/0.30 % (6114)Instructions burned: 5 (million)
% 0.08/0.30 % (6114)------------------------------
% 0.08/0.30 % (6114)------------------------------
% 0.08/0.30 % (6116)Instruction limit reached!
% 0.08/0.30 % (6116)------------------------------
% 0.08/0.30 % (6116)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.08/0.30 % (6116)Termination reason: Unknown
% 0.08/0.30 % (6116)Termination phase: Saturation
% 0.08/0.30
% 0.08/0.30 % (6116)Memory used [KB]: 5500
% 0.08/0.30 % (6116)Time elapsed: 0.003 s
% 0.08/0.30 % (6116)Instructions burned: 2 (million)
% 0.08/0.30 % (6116)------------------------------
% 0.08/0.30 % (6116)------------------------------
% 0.08/0.30 % (6118)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on Vampire---4 for (3000ds/275Mi)
% 0.08/0.30 % (6115)First to succeed.
% 0.08/0.30 % (6115)Refutation found. Thanks to Tanya!
% 0.08/0.30 % SZS status Theorem for Vampire---4
% 0.08/0.30 % SZS output start Proof for Vampire---4
% See solution above
% 0.08/0.30 % (6115)------------------------------
% 0.08/0.30 % (6115)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.08/0.30 % (6115)Termination reason: Refutation
% 0.08/0.30
% 0.08/0.30 % (6115)Memory used [KB]: 5500
% 0.08/0.30 % (6115)Time elapsed: 0.004 s
% 0.08/0.30 % (6115)Instructions burned: 4 (million)
% 0.08/0.30 % (6115)------------------------------
% 0.08/0.30 % (6115)------------------------------
% 0.08/0.30 % (6112)Success in time 0.003 s
% 0.08/0.30 % Vampire---4.8 exiting
%------------------------------------------------------------------------------